home *** CD-ROM | disk | FTP | other *** search
- Path: munnari.OZ.AU!metro!metro!OzEmail!usenet
- From: Dave Meagher <davem@sb00.sb.com.au>
- Newsgroups: comp.programming,comp.lang.c
- Subject: Re: Indexing for database...
- Date: 1 Apr 1996 23:11:20 GMT
- Organization: System Builder Dev. (Aust)
- Message-ID: <4jpnqo$i2@oznet11.ozemail.com.au>
- References: <mikenelDot574.8n9@netcom.com>
- NNTP-Posting-Host: sb20.sb.com.au
- Mime-Version: 1.0
- Content-Type: text/plain; charset=us-ascii
- Content-Transfer-Encoding: 7bit
- X-Mailer: Mozilla 1.2N (Windows; I; 16bit)
-
- mikenel@netcom.com (Michael Nelson) wrote:
- >I am in the process of trying to figure out the best way to do indexing for
- >an on-disk database. Most databases and modern file systems seem to use
- >b-trees to do fast lookups of records or directory entries. However, the
- >biggest problem I forsee is the fact that it is difficult to keep the tree
- >balanced. Strange enough, none of the source code I've perused so far seems to
- >bother with keeping the trees balanced.
- >
-
- Hmm, Btree indexes are, by default, 'balanced'. This is one of their most
- important properties. I think you need to find a book on the subject.
- Consider: 'File Structures (2nd edition) by Michael J Folk & Bill
- Zoellick' ISBN 0-201-55713-4
-
- >Anyone with more experience (or examples) have any ideas? :-)
- >
- >-- Mike
- >--
- >--
- > movl %cr0, %eax; orl $0x1, %eax; movl %eax, %cr0
- >=============================================================================
- >Michael Nelson mikenel@netcom.com
- >Seattle, Washington Windows NT, OLE, BSD UNIX, Linux Development
-
- Regards,
- Dave
-
-
-